Definability, Constructibility and Transfer
نویسنده
چکیده
Throughout, we will fix an algebraically closed field K. Classical algebraic geometry studies varieties defined over K, where in this proposal, a variety means a solution set of some polynomial equation system over K. Therefore, the study of a variety V is equivalent to the study of the maximal spectrum of its coordinate ring A(V ). Grothendieck realized that a relative version of the concept of a variety, termed scheme, would allow for the infinitesimal study of varieties, and at the same time, greatly facilitate the study of algebraic families of varieties (if f : X → S is morphism of schemes, then the collection of all its fibers forms an algebraic family of varieties). To fully exploit this new point of view, the classical notion of point as a K-rational solution has to be replaced by allowing arbitrary L-rational solutions (up to some obvious congruence relation), where L is any extension field of K. Put differently, this leads to the study of all prime ideals of the coordinate ring, or, for that matter, of any ring. The main principle of modern algebraic geometry could be phrased as follows.
منابع مشابه
Ultraproducts of Noetherian Local Rings: Properties and Applications
The present proposal is in part a continuation of the NSF Research Proposal Definability, Constructibility and Transfer (DMS-0100778/DMS-0302248 in the amount of $69,276; project details are given in §4.3 and the introduction to §5). Whereas the latter proposal was submitted via the division Foundations, in view of the underlying tools stemming from model-theory, the present proposal is cast en...
متن کاملLevy and set theory
Azriel Levy (1934–) did fundamental work in set theory when it was transmuting into a modern, sophisticated field of mathematics, a formative period of over a decade straddling Cohen’s 1963 founding of forcing. The terms “Levy collapse”, “Levy hierarchy”, and “Levy absoluteness” will live on in set theory, and his technique of relative constructibility and connections established between forcin...
متن کاملLSM is not generated by binary functions
We will construct a set C containing binary lsm functions and closed under a minimalist set of operations related to T2-constructibility [3]. Later, in section 3, we will relate this to ppsω-definability. For concision we will use vector notation such as x = (x1, · · · , xn), (x,y) = (x1, · · · , xn, y1, · · · , ym), 1 = (1, · · · , 1), (i, j,x) = (i, j, x1, · · · , xn), and x · y = x1y1 + · · ...
متن کاملA New Proof for the Monte Carlo Constructibility of Log Log N
The Monte Carlo constructibility of log logn has proved by Karpinski and Verbeek ([KV87]). They proposed an algorithm, and proved the constructibility by applying a statistical result in [Fel57] to the algorithm. We give a new algorithm, and prove the constructibility by analyzing the algorithm.
متن کاملFrom Linear to Branching-Time Temporal Logics: Transfer of Semantics and Definability
This paper investigates logical aspects of combining linear orders as semantics for modal and temporal logics, with modalities for possible paths, resulting in a variety of branching time logics over classes of trees. Here we adopt a unified approach to the Priorean, Peircean and Ockhamist semantics for branching time logics, by considering them all as fragments of the latter, obtained as combi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005